Tessellating polyominos in the plane
نویسندگان
چکیده
Let the R2 space be divided into unit squares where a polyomino is a finite, connected set of unit squares. In this paper, we give a necessary and sufficient condition on tessellating polyominos by observing an unexpected relation between such tessellations and systems of arithmetic progressions. © 2006 Elsevier B.V. All rights reserved.
منابع مشابه
Enumeration of inscribed polyominos
We introduce a new family of polyominos that are inscribed in a rectangle of given size for which we establish a number of exact formulas and generating functions. In particular, we study polyominos inscribed in a rectangle with minimum area and minimum area plus one. These results are then used for the enumeration of lattice trees inscribed in a rectangle with minimum area plus one. Résumé. No...
متن کاملArbitrary versus Periodic Storage Schemes and Tessellations of the Plane Using One Type of Polyomino
Given N distinct memory modules, the elements of an (infinite) array in storage are distributed such that any set of N elements arranged according to a given data template T can be accessed rapidly in parallel. Array embeddings that allow for this are called skewing schemes and have been studied in connection with vector processing and SIMD machines. In 1975 Shapiro (IEEE Trans. Comput. C-27 (1...
متن کاملPolyominos and Perfect Graphs
Polyominos are useful for modelizing real-life problems. Many graphs can be associated with polyominos. Because some NP-problems become polynomial for the class of perfect graph, to know whether or not these graphs are perfect is important from an algorithmic point of view. In this paper we shall investigate the perfection of several of these graphs.
متن کاملEnumeration of minimal 3D polyominoes inscribed in a rectangular prism
We consider the family of 3D minimal polyominoes inscribed in a rectanglar prism. These objects are polyominos and so they are connected sets of unitary cubic cells inscribed in a given rectangular prism of size b×k×h and of minimal volume equal to b + k + h − 2. They extend the concept of minimal 2D polyominoes inscribed in a rectangle studied in a previous work. Using their geometric structur...
متن کاملHeesch's Tiling Problem
1. INTRODUCTION. Let T be a tile in the plane. By calling T a tile, we mean that T is a topological disk whose boundary is a simple closed curve. But also implicit in the word " tile " is our intent to use congruent or reflected copies of T to cover the plane without gaps or overlapping; that is, we want to tessellate the plane with copies of T. In a minor abuse of language, one often speaks of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006